Second-Order Equational Logic
نویسندگان
چکیده
We provide an extension of universal algebra and its equational logic from first to second order. Conservative extension, soundness, and completeness results are established.
منابع مشابه
Second-order algebraic theories
Fiore and Hur [10] recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a formal deductive system for languages with variable binding and parameterised metavariables. This work completes the foundations of the subject from the vie...
متن کاملCompletion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules
We consider a constrained equational logic where the constraints are membership conditions t 2 s where s is interpreted as a regular tree language. Our logic includes a fragment of second order equational logic (without projections) where second order variables range over regular sets of contexts. The problem with constrained equational logics is the failure of the critical pair lemma. That is ...
متن کاملHigher-Order Narrowing
We introduce several approaches for solving higher order equational problems by higher order narrow ing and give rst completeness results The results apply to higher order functional logic programming languages and to higher order uni cation modulo a higher order equational theory We lift the general notion of rst order narrow ing to so called higher order patterns and argue that the full highe...
متن کاملA Semantics for Equational Hybrid Propositional Type Theory
The definition of identity in terms of other logical symbols is a recurrent issue in logic. In particular, in First-Order Logic (FOL) there is no way of defining the global relation of identity, while in standard Second-Order Logic (SOL) this definition is not only possible, but widely used. In this paper, the reverse question is posed and affirmatively answered: Can we define with only equalit...
متن کاملIs observational congruence on µ-expressions axiomatisable in equational Horn logic?
It is well known that bisimulation on μ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/Ésik necessarily involve implicational rules. However, both systems rely on features beyond pure equational Horn logic: either rules that are impure by involving non-equational side-conditions, or rules that are schematically infinita...
متن کامل